An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability
نویسندگان
چکیده
The purpose of this paper is to present an algorithm which generates linear extensions for a non-simplylaced d-complete poset with uniform probability. Résumé. Le but de ce papier est présenter un algorithme qui produit des extensions linéaires pour une non-simplylaced d-complete poset avec probabilité constante.
منابع مشابه
Using TPA to count linear extensions
A linear extension of a poset P is a permutation of the elements of the set that respects the partial order. Let L(P ) denote the number of linear extensions. It is a #P complete problem to determine L(P ) exactly for an arbitrary poset, and so randomized approximation algorithms that draw randomly from the set of linear extensions are used. In this work, the set of linear extensions is embedde...
متن کاملA poset connected to Artin monoids of simply laced type
Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W -orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representations of the corresponding Artin group A. The poset generalizes many properties of the usual order on positive roots of W given by height. In this paper, a linear representation of the positive monoid of A ...
متن کاملNear-linear time simulation of linear extensions of a height-2 poset with bounded interaction
A linear extension of a poset ([n], ) is a permutation σ such that if σ(i) σ( j), then i ≤ j. The problem considered here is sampling uniformly from the set of linear extensions. The best known algorithm for the general problem requires time O(n3 lnn). This work presents the first new method that is provably faster for a nontrivial class of posets. Specifically, when the poset is height-2 (so t...
متن کاملMining Posets from Linear Orders
There has been much research on the combinatorial problem of generating the linear extensions of a given poset. This paper focuses on the reverse of that problem, where the input is a set of linear orders, and the goal is to construct a poset or set of posets that generates the input. Such a problem finds applications in computational neuroscience, systems biology, paleontology, and physical pl...
متن کاملThe Linear Extension Diameter of a Poset
The distance between two permutations of the same set X is the number of pairs of elements being in di erent order in the two permutations Given a poset P X a pair L L of linear extensions is called a diametral pair if it maximizes the distance among all pairs of linear extensions of P The maximal distance will be called the linear extension diameter of P and is denoted led P Alternatively led ...
متن کامل